Linear Time and Memory-Efficient Computation

Linear Time and Memory-Efficient Computation

A realistic model of computation called the Block Move (BM) model is developed. The BM regards computation as a sequence of finite transductions in memory, and operations are timed according to a memory cost parameter μ. Unlike previous memory-cost models, the BM provides a rich theory of linear time, and in contrast to what is known for Turing machines, the BM is proved to be highly robust for...

Efficient computation of stability charts for linear time delay systems

A new efficient algorithm for the computation of the stability chart of linear time delay systems is proposed and tested on several examples. The stability chart is obtained by investigating the 2d-parameter space by a first coarse square grid which is then adaptively refined by triangulation to match the desired tolerance. This leads to a considerable reduction in computational cost with respe...

Space Efficient Linear Time Computation of the Bwt

Efficient Linear Optics Quantum Computation: Supplementary Information

In the paper we claimed that teleportation with |tn〉 satisfies that if 0 < k < n + 1, then the teleported state appears in mode n + k and only needs to be corrected by applying a phase shift. The modes 2n − l are in state 1 for 0 ≤ l < (n − k) and can be reused in future preparations requiring single photons. The modes 2n − l are in state 0 for n − k < l < n. If k = 0 we learn that the input st...

Resource-efficient linear optical quantum computation.

We introduce a scheme for linear optics quantum computation, that makes no use of teleported gates, and requires stable interferometry over only the coherence length of the photons. We achieve a much greater degree of efficiency and a simpler implementation than previous proposals. We follow the "cluster state" measurement based quantum computational approach, and show how cluster states may be...